R3D3: A Doubly Opportunistic Data Structure for Compressing and Indexing Massive Data
نویسندگان
چکیده
منابع مشابه
Compressing and Indexing Stock Market Data
We show how to build a compressed index for the offline Order Preserving Pattern Matching problem. Our solution is based on the new approach of decomposing the sequence to be indexed into an order component, containing ordering information, and a δ component, containing information on the absolute values. The Order Preserving Matching problem is then transformed into an exact matching problem o...
متن کاملa new approach to credibility premium for zero-inflated poisson models for panel data
هدف اصلی از این تحقیق به دست آوردن و مقایسه حق بیمه باورمندی در مدل های شمارشی گزارش نشده برای داده های طولی می باشد. در این تحقیق حق بیمه های پبش گویی بر اساس توابع ضرر مربع خطا و نمایی محاسبه شده و با هم مقایسه می شود. تمایل به گرفتن پاداش و جایزه یکی از دلایل مهم برای گزارش ندادن تصادفات می باشد و افراد برای استفاده از تخفیف اغلب از گزارش تصادفات با هزینه پائین خودداری می کنند، در این تحقیق ...
15 صفحه اولStorage and indexing of massive data.
This issue contains papers presented at the Theo Murphy international scientific meeting on ‘Storage and indexing of massive data’. The meeting was held at the Royal Society at Chichely Hall, Buckinghamshire, home of the Kavli Royal Society International Centre, on 7–8 February 2013. Big data is a subject which has attracted significant interest in recent years. In the past, the speed at which ...
متن کاملMKL-Tree: A Hierarchical Data Structure for Indexing Multidimensional Data
Recently, multidimensional point indexing has generated a great deal of interest in applications where objects are usually represented through feature vectors belonging to high-dimensional spaces and are searched by similarity according to a given example. Unfortunately, although traditional data structures and access methods work well for low-dimensional spaces, they perform poorly as dimensio...
متن کاملCompression, Indexing, and Retrieval for Massive String Data
The field of compressed data structures seeks to achieve fast search time, but using a compressed representation, ideally requiring less space than that occupied by the original input data. The challenge is to construct a compressed representation that provides the same functionality and speed as traditional data structures. In this invited presentation, we discuss some breakthroughs in compres...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Infocommunications journal
سال: 2019
ISSN: 2061-2079
DOI: 10.36244/icj.2019.2.7